A COMPARISON OF OPTIMIZATION METHODS FOR MULTI-OBJECTIVE CONSTRAINED BIN PACKING PROBLEMS Philippe Olivier

Source URL: cerc-datascience.polymtl.ca

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Source URL: www.daviddelaat.nl

• Graph theory
• Mathematics
• NP-complete problems
• Information theory
• Combinatorial optimization
• NP-hard problems
• Lovsz number
• Independent set

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Source URL: resources.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Packing problems
• Operations research
• Approximation algorithms
• Knapsack problem
• Vertex cover
• Bin packing problem
• Hardness of approximation
• Algorithm

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Source URL: www.daviddelaat.nl

• Mathematics
• Geometry
• Discrete geometry
• NP-complete problems
• Circle packing
• Conjectures
• Operations research
• Sphere packing
• Independent set
• Tammes problem
• Kepler conjecture
• Semidefinite programming

Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Source URL: www.math.washington.edu

• Computational complexity theory
• Packing problems
• Theory of computation
• Bin packing problem
• Bin

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

Source URL: theory.stanford.edu

• Computational complexity theory
• Mathematics
• Applied mathematics
• Packing problems
• Operations research
• Algorithm
• Mathematical logic
• Theoretical computer science
• Online algorithm
• Bin packing problem
• Sorting algorithm
• Knapsack problem

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Source URL: tandy.cs.illinois.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Combinatorial optimization
• Packing problems
• Approximation algorithms
• Knapsack problem
• NP
• APX

CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5,

Source URL: theory.stanford.edu

• Operations research
• Mathematical optimization
• Mathematics
• Packing problems
• Mathematical analysis
• Academia
• Cryptography
• Knapsack problem
• Multi-objective optimization
• Pareto efficiency
• Probability distribution
• Pareto distribution